Quasi-self-stabilization of a distributed system assuming read/write atomicity

Quasi-self-stabilization of a distributed system assuming read/write atomicity

Self-stabilizing systems of the Dolev type were first introduced by Dolev et al. in their famous paper in 1993. In contrast to self-stabilizing systems of the Dijkstra type, such self-stabilizing systems assume the read/write atomicity model instead of the composite atomicity model. In this paper, we introduce the notion of quasi-self-stabilizing systems of the Dolev type. A naturally-adapted v...

Stabilization-Preserving Atomicity Refinement

Program refinements from an abstract to a concrete model empower designers to reason effectively in the abstract and architects to implement effectively in the concrete. For refinements to be useful, they must not only preserve functionality properties but also dependability properties. In this paper, we focus our attention on refinements that preserve the dependability property of stabilizatio...

Stabilization of a Type III Thermoelastic Bresse System with Distributed Delay-time

In this paper, we investigate a Bresse-type system of thermoelasticity of type III in the presence of a distributed delay. We prove the well-posedness of the problem. Furthermore, an exponential stability result will be shown without the usual assumption on the wave speeds. To achieve our goals, we make use of the semigroup method and the energy method.

Term Paper: SELF STABILIZATION IN DISTRIBUTED SYSTEMS

Distributed verification and Self-stabilization of a DFS Tree

It is a common practice in distributed systems to compute and maintain distributed data structures such as a spanning tree of the network, which can be used by many other algorithms. Corruption of these data structures can cause the protocols that use them to behave incorrectly. A DFS (Depth First Search) spanning tree of a network is one such structure which is very used in various routing pro...